computing vertex pi, omega and sadhana polynomials of f12(2n+1) fullerenes

نویسندگان

m. ghorbani

چکیده

the topological index of a graph g is a numeric quantity related to g which is invariant underautomorphisms of g. the vertex pi polynomial is defined as piv (g)  euv nu (e)  nv (e).then omega polynomial (g,x) for counting qoc strips in g is defined as (g,x) =cm(g,c)xc with m(g,c) being the number of strips of length c. in this paper, a new infiniteclass of fullerenes is constructed. the vertex pi, omega and sadhana polynomials of this classof fullerenes are computed for the first time.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Vertex PI, Omega and Sadhana Polynomials of F12(2n+1) Fullerenes

The topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. The vertex PI polynomial is defined as PIv (G)  euv nu (e)  nv (e). Then Omega polynomial (G,x) for counting qoc strips in G is defined as (G,x) = cm(G,c)xc with m(G,c) being the number of strips of length c. In this paper, a new infinite class of fullerenes is constructed. ...

متن کامل

Computing Vertex PI, Omega and Sadhana Polynomials of F12(2n+1) Fullerenes

The topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. The vertex PI polynomial is defined as v u v e uv PI (G) n (e) n (e). = = + ∑ Then Omega polynomial Ω(G,x) for counting qoc strips in G is defined as Ω(G,x) = ∑cm(G,c)x with m(G,c) being the number of strips of length c. In this paper, a new infinite class of fullerenes is construc...

متن کامل

On Omega and Sadhana Polynomials of Leapfrog Fullerenes

A fullerene graph is a cubic 3-connected plane graph with (exactly 12) pentagonal faces and hexagonal faces. Let Fn be a fullerene graph with n vertices. By the Euler formula one can see that Fn has 12 pentagonal and n/2 – 10 hexagonal faces. Let G = (V, E) be a connected graph with the vertices set V = V(G) and the edges set E = E(G), without loops and multiple edges. The distance d(x,y) betwe...

متن کامل

Computing Vertex PI Index of Tetrathiafulvalene Dendrimers

General formulas are obtained for the vertex Padmakar-Ivan index (PIv) of tetrathiafulvalene (TTF) dendrimer, whereby TTF units we are employed as branching centers. The PIv index is a Wiener-Szeged-like index developed very recently. This topological index is defined as the summation of all sums of nu(e) and nv(e), over all edges of connected graph G.

متن کامل

computing vertex pi index of tetrathiafulvalene dendrimers

general formulas are obtained for the vertex padmakar-ivan index (piv) of tetrathiafulvalene(ttf) dendrimer, whereby ttf units we are employed as branching centers. the piv index isa wiener-szeged-like index developed very recently. this topological index is defined as thesummation of all sums of nu(e) and nv(e), over all edges of connected graph g.

متن کامل

The Vertex PI, Szeged and Omega Polynomials of Carbon Nanocones CNC4[n]

A topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. A new counting polynomial, called the "Omega" W(G, x) polynomial, was recently proposed by Diudea on the ground of quasi-orthogonal cut "qoc" edge strips in a polycyclic graph. In this paper, the vertex PI, Szeged and omega polynomials of carbon nanocones CNC4[n] are computed.

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
iranian journal of mathematical chemistry

ناشر: university of kashan

ISSN 2228-6489

دوره 1

شماره Issue 1 (Special Issue on the Role of PI Index in Nanotechnology) 2010

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023